Constraint Based Reasoning with Constraint Logic Programming and Array Based Logic
نویسنده
چکیده
The paper describes how Constraint Based Reasoning (CBR) can be performed with two di erent paradigms, Constraint Logic Programming (CLP) and Array Based Logic (ABL). The author describes the operation of Constraint Logic Programming emphasizing CLP techniques for nite domain problems such as search strategies and consistency techniques. An explanation of Array Based Logic is presented including a description of methods for creating, joining and compressing ABL relations as well as an heuristic for building a system of relations in ABL. A familiar cryptogram is used as an example to demonstrate the operation of the two approaches for nite domain constraint problems. Some potential avenues of research are also presented.
منابع مشابه
Description Logic with Constraint Propagation Rules
The challenges of the Semantic Web endeavour in knowledge representation and reasoning prompted a wealth of research in combining description logic (DL) as ontology languages (e.g. OWL) with logic programming for rule-based reasoning. General issues of combining and integrating formalisms have to be faced such as the type of combination, conceptual simplicity and tractability. Even though const...
متن کاملDescription Logic and Rules the CHR Way Extended Abstract
The challenges of the Semantic Web endeavour in knowledge representation and reasoning prompted a wealth of research in combining description logic (DL) as ontology languages (e.g. OWL) with logic programming for rule-based reasoning. General issues of combining and integrating formalisms have to be faced such as the type of combination, conceptual simplicity and tractability. Even though const...
متن کاملSemiring-based Constraint Logic Programming Content Areas: Constraint Satisfaction, Automated Reasoning
We extend the Constraint Logic Programming (CLP) formalism in order to handle semiring-based constraint systems. This allows us to perform in the same language both constraint solving and optimization. In fact, constraint systems based on semirings are able to model both classical constraint solving and more sophisticated features like uncertainty, probability , fuzzyness, and optimization. We ...
متن کاملSemantic Query Optimization through Abduction and Constraint Handling
The use of integrity constraints to perform Semantic Query Optimization (SQO) in deductive databases can be formalized in a way similar to the use of integrity constraints in Abductive Logic Programming (ALP) and the use of Constraint Handling Rules in Constraint Logic Programming (CLP). Based on this observation and on the similar role played by, respectively, extensional, abducible and constr...
متن کاملA Comparison of Logic Programming Approaches for Representation and Solving of Constraint Satisfaction Problems
Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there are definite programs and constraint logic programs that compute a solution as an answer substitution to a query containing the variables of the constraint satisfaction problem. On the other hand there are approaches based on stable model semantics, abduction, and first...
متن کامل